Determinism vs. Nondeterminism in Multiparty Communication Complexity
نویسندگان
چکیده
منابع مشابه
Multiparty Quantum Communication Complexity
Quantum entanglement cannot be used to achieve direct communication between remote parties, but it can reduce the communication needed for some problems. Let each of k parties hold some partial input data to some fixed k-variable function f . The communication complexity of f is the minimum number of classical bits required to be broadcasted for every party to know the value of f on their input...
متن کاملTensor Rank and Strong Quantum Nondeterminism in Multiparty Communication
In this paper we study quantum nondeterminism in multiparty communication. There are three (possibly) different types of nondeterminism in quantum computation: i) strong, ii) weak with classical proofs, and iii) weak with quantum proofs. Here we focus on the first one. A strong quantum nondeterministic protocol accepts a correct input with positive probability, and rejects an incorrect input wi...
متن کاملMultiparty Communication Complexity of AC
We prove n lower bounds on the multiparty communication complexity of AC functions in the number-on-forehead (NOF) model for up to Θ(logn) players. These are the first lower bounds for any AC function for ω(log logn) players. In particular we show that there are families of depth 3 read-once AC formulas having k-player randomized multiparty NOF communication complexity n/2. We show similar lowe...
متن کاملInformation Complexity for Multiparty Communication
In this paper, we have studied the information complexity for the communication model involving more than two parties. A lot of work has already been done on the information complexity in two party communication model and the question of extending the definition of information complexity to the multiparty communication model was posed in [Bra12]. In this paper, we first give a definition of int...
متن کاملMultiparty Communication Complexity of Disjointness
We obtain a lower bound of n on the k-party randomized communication complexity of the Disjointness function in the ‘Number on the Forehead’ model of multiparty communication when k is a constant. For k = o(log logn), the bounds remain super-polylogarithmic i.e. (logn). The previous best lower bound for three players until recently was Ω(logn). Our bound separates the communication complexity c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1992
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0221052